An Optimal Algorithm for Enumerating Connected Convex Subgraphs in Acyclic Digraphs
نویسندگان
چکیده
منابع مشابه
An Algorithm for Finding Connected Convex Subgraphs of an Acyclic Di- graph
A subgraph H of an acyclic digraph D is convex if there is no directed path between vertices of H which contains an arc not in H. A digraph D is connected if the underlying undirected graph of D is connected. We construct an algorithm for enumeration of all connected convex subgraphs of a connected acyclic digraph D of order n. The time complexity of the algorithm is O(n · cc(D)), where cc(D) i...
متن کاملAcyclic Subgraphs of Planar Digraphs
An acyclic set in a digraph is a set of vertices that induces an acyclic subgraph. In 2011, Harutyunyan conjectured that every planar digraph on n vertices without directed 2-cycles possesses an acyclic set of size at least 3n/5. We prove this conjecture for digraphs where every directed cycle has length at least 8. More generally, if g is the length of the shortest directed cycle, we show that...
متن کاملConvex Sets in Acyclic Digraphs
A non-empty set X of vertices of an acyclic digraph is called connected if the underlying undirected graph induced by X is connected and it is called convex if no two vertices of X are connected by a directed path in which some vertices are not in X. The set of convex sets (connected convex sets) of an acyclic digraph D is denoted by CO(D) (CC(D)) and its size by co(D) (cc(D)). Gutin, Johnstone...
متن کاملFinding Induced Acyclic Subgraphs in Random Digraphs
Consider the problem of finding a large induced acyclic subgraph of a given simple digraph D = (V,E). The decision version of this problem is NP -complete and its optimization is not likely to be approximable within a ratio of O(n ) for some > 0. We study this problem when D is a random instance. We show that, almost surely, any maximal solution is within an o(ln n) factor from the optimal one....
متن کاملOn the number of connected convex subgraphs of a connected acyclic digraph
A digraph D is connected if the underlying undirected graph of D is connected. A subgraph H of an acyclic digraph D is convex if there is no directed path between vertices of H which contains an arc not in H. We find the minimum and maximum possible number of connected convex subgraphs in a connected acyclic digraph of order n. Connected convex subgraphs of connected acyclic digraphs are of int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Circuits and Systems II: Express Briefs
سال: 2021
ISSN: 1549-7747,1558-3791
DOI: 10.1109/tcsii.2020.3000297